Robust shortest path problems
نویسندگان
چکیده
This paper is a state of the art on the shortest path problems for which it exists uncertainty and inaccuracy factors on arc values. Two uncertainty models are distinguished: the so-called interval model and the discrete set of scenarios model. Different measures and approaches of robustness are presented: those coming from decision theory, those coming from multicriteria analysis and those coming from mathematical programming. Each one leads to a particular version of robust shortest path problem for which complexity and resolution are studied.
منابع مشابه
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems
Demand-robust versions of common optimization problems were recently introduced by Dhamdhere et al. [4] motivated by the worst-case considerations of two-stage stochastic optimization models. We study the demand robust min-cut and shortest path problems, and exploit the nature of the robust objective to give improved approximation factors. Specifically, we give a (1 + √ 2) approximation for rob...
متن کاملAn Experimental Comparison of Uncertainty Sets for Robust Shortest Path Problems
Through the development of efficient algorithms, data structures and preprocessing techniques, real-world shortest path problems in street networks are now very fast to solve. But in reality, the exact travel times along each arc in the network may not be known. This led to the development of robust shortest path problems, where all possible arc travel times are contained in a so-called uncerta...
متن کاملRobust Shortest Path Problems with Two Uncertain Multiplicative Cost Coefficients
We consider a robust shortest path problem when the cost coefficient is the product of two uncertain factors. We first show that the robust problem can be solved in polynomial time by a dual variable enumeration with shortest path problems as subproblems. We also propose a path enumeration approach using a K-shortest paths finding algorithm that may be efficient in many real cases. An applicati...
متن کاملRecoverable robust shortest path problems
Recoverable robustness is a concept to avoid over-conservatism in robust optimization by allowing a limited recovery after the full data is revealed. We investigate two settings of recoverable robust shortest path problems. In both settings the costs of the arcs are subject to uncertainty. For the first setting, at most k arcs of the chosen path can be altered in the recovery. In the second set...
متن کاملThe robust shortest path problem with interval data via Benders decomposition
Many real problems can bemodelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs. In this paper we discuss the application of a Benders decomposition approach to this problem. Computational results confirm the efficien...
متن کامل